﻿

approximated

przybliżony

English-Polish dictionary of Electronics and Computer Science. 2013.

Look at other dictionaries:

• Approximated — Approximate Ap*prox i*mate, v. t. [imp. & p. p. {Approximated}; p. pr. & vb. n. {Approximating}.] 1. To carry or advance near; to cause to approach. [1913 Webster] To approximate the inequality of riches to the level of nature. Burke. [1913… …   The Collaborative International Dictionary of English

• approximated — apÂ·proxÂ·iÂ·mate || É™ prÉ’ksÉªmÉ™t v. approach, come near adj. near, approaching …   English contemporary dictionary

• approximated — …   Useful english dictionary

• approximated uncertainty — apytikslė neapibrėžtis statusas T sritis Standartizacija ir metrologija apibrėžtis Matavimo neapibrėžtis, įvertinta naudojant supaprastintą iteracijų metodą. atitikmenys: angl. approximated uncertainty rus. приближенная неопределенность, f pranc …   Penkiakalbis aiškinamasis metrologijos terminų žodynas

• estimated file length is — approximated size of the file is …   English contemporary dictionary

• Zeta function universality — In mathematics, the universality of zeta functions is the remarkable property of the Riemann zeta function and other, similar, functions, such as the Dirichlet L functions, to approximate arbitrary non vanishing holomorphic functions arbitrarily… …   Wikipedia

• List of Crayola crayon colors — Twelve of Crayola s 133 standard crayon colors Crayola s thirteen retired colors …   Wikipedia

• Common integrals in quantum field theory — There are common integrals in quantum field theory that appear repeatedly.[1] These integrals are all variations and generalizations of gaussian integrals to the complex plane and to multiple dimensions. Other integrals can be approximated by… …   Wikipedia

• Lumped element model — In general, the lumped component model is a way of simplifying the behaviour of spatially distributed systems into a topology consisting of discrete entities that approximate the behaviour of the distributed system under certain assumptions. It… …   Wikipedia

• Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… …   Wikipedia

• Photonic metamaterial — Electromagnetism Electricity · …   Wikipedia